#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

//不用加减乘除做加法，位运算
int Add(int num1, int num2)
{
    while(num2 != 0)
    {
        int n1 = num1 ^ num2; //异或，不考虑进位
        int n2 = (num1 & num2) << 1; //与，只考虑进位
        num1 = n1;
        num2 = n2;
    }
    return num1;
}

void test()
{
}

int main()
{
    test();
    return 0;
}